#include "BinarySearchTree.h"
#include <iostream>

template <typename T>

void BST_sort(std::vector<T> &_data);
void Randomized_BST_sort(std::vector<T> &_data);
void order(BinaryNode* _x)

void BST_sort(std::vector<T> &_data);
{
    BinarySearchTree<Comparable> A;
    int length =data.size();
    for(int i=0;i<length;i++)
    {
        A.insert(data[i]);
    }
        A.order(A.root);
}

void order(BinaryNode* _x)
{
        if (_x==nullptr)
        return;
        else
        {
            order(_x->left);
	        std::cout << _x->data << "\t";
            order(_x->right);
        }
}
int main( )
{
    int n;
    std::cout << "Please input the length of Vector:" << std::endl;
    std::cin >> n;
    std::vector <int> A;
    BST_sort(A);
    return 0;
}
